Properties and Design of Variable-to-Variable Length Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources

-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).

متن کامل

Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes

It is proved that for finite-alphabet, finite-state unifilar sources, variable-to-fixed length codes provide better large deviations performance of the empirical compression ratio, than fixed-to-variable Manuscript received March 21, 1990; revised March 6, 1991. N. Merhav was with AT&T Bell Laboratories, Murray Hill, NJ. He is now with the Department of Electrical Engineering, Technion-Israel I...

متن کامل

On the Analysis of Variable-to-Variable Length Codes

We use the \conservation of entropy" 1] to derive a simple formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources. We obtain new asymptotic upper bounds on the redundancy of the \Tunstall-Huuman" code and the \Tunstall-Shannon-Fano" code. For some sources we provide the best existing upper bound for the smallest achievable asymptotic red...

متن کامل

A Comparative Complexity Study of Fixed-to-variable Length and Variable-to-fixed Length Source Codes

In this paper we present an analysis of the storage complexity of Huffman codes, Tunstall codes and arithmetic codes in various implementations and relate this to the achieved redundancies. It turns out that there exist efficient implementations of both Huffman and Tunstall codes and that their approximations result in arithmetic codes. Although not optimal, the arithmetic codes still have a be...

متن کامل

A Study of Variable Length Error Correcting Codes and Reversible Variable Length Codes: Analysis and Applications

is an authentic record of my work carried out under the supervision of Prof. N. Kalyanasundaram and Prof. Bhudev Sharma. I have not submitted this work elsewhere for any other degree or diploma. I am fully responsible for the contents of my Ph.D. Thesis. is a bonafide record of her original work carried out under our supervision. This work has not been submitted elsewhere for any other degree o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Multimedia Computing, Communications, and Applications

سال: 2018

ISSN: 1551-6857,1551-6865

DOI: 10.1145/3230653